A Model of Analogy-Driven Proof-Plan Construction
نویسنده
چکیده
This paper addresses a model of analogy-driven theorem proving that is more general and cognitively more adequate than previous approaches. The model works at the level of proof-plans. More precisely, we consider analogy as a control strategy in proof planning that employs a source proof-plan to guide the construction of a proof-plan for the target problem. Our approach includes a reformulation of the source proof-plan. This is in accordance with the well known fact that constructing an analogy in maths often amounts to rst nd-ing the appropriate representation which brings out the similarity of two problems, i.e., nding the right concepts and the right level of abstraction. Several well known theorems were processed by our analogy-driven proof-plan construction that could not be proven analogically by previous approaches.
منابع مشابه
Proving a Heine-Borel Theorem by Analogy
This paper addresses analogy-driven automated theorem proving that employs a source proof-plan to guide the search for a proof-plan of the target problem. The approach presented uses reformulations that go beyond symbol mappings and that incorporate frequently used re-representations and abstractions. Several realistic math examples were successfully processed by our analogy-driven proof-plan c...
متن کاملExternal Analogy in Inductive Theorem Proving
This paper investigates analogy-driven proof plan construction in inductive theorem proving. Given a proof plan of a source theorem, we identify constraints of second-order mappings that enable a replay of the source plan to produce a similar plan for the target theorem. In addition, the analogical replay is controlled by justiications that have to be satissed in the target. Our analogy procedu...
متن کاملTheorem Proving by Analogy - A Compelling Example
This paper shows how a new approach to theorem proving by analogy is applicable to real maths problems. This approach works at the level of proof-plans and employs reformulation that goes beyond symbol mapping. The Heine-Borel theorem is a widely known result in mathematics. It is usually stated in R 1 and similar versions are also true in R 2 , in topology, and metric spaces. Its analogical tr...
متن کاملAnalogy in CLAM
CL A M is a proof planner, developed by the Dream group in Edinburgh, that mainly operates for inductive proofs. This paper addresses the question how an analogy model that I developed independently of CL A M can be applied to CL A M and it presents analogy-driven proof plan construction as a control strategy of CL A M. This strategy is realized as a derivational analogy that includes the refor...
متن کامل